Approximate Model-Based Diagnosis Using Greedy Stochastic Search
نویسندگان
چکیده
منابع مشابه
Approximate Model-Based Diagnosis Using Greedy Stochastic Search Approximate Model-Based Diagnosis Using Greedy Stochastic Search
We propose a StochAstic Fault diagnosis AlgoRIthm, called Safari, which trades off guarantees of computing minimal diagnoses for computational efficiency. We empirically demonstrate, using the 74XXX and ISCAS85 suites of benchmark combinatorial circuits, that Safari achieves several orders-of-magnitude speedup over two well-known deterministic algorithms, CDA∗ and HA∗, for multiple-fault diagno...
متن کاملApproximate Model-Based Diagnosis Using Greedy Stochastic Search
We propose a StochAstic Fault diagnosis AlgoRIthm, called Safari, which trades off guarantees of computing minimal diagnoses for computational efficiency. We empirically demonstrate, using the 74XXX and ISCAS85 suites of benchmark combinatorial circuits, that Safari achieves several orders-of-magnitude speedup over two well-known deterministic algorithms, CDA∗ and HA∗, for multiple-fault diagno...
متن کاملApproximate Model-Based Diagnosis Using Preference-Based Compilation
This article introduces a technique for improving the efficiency of diagnosis through approximate compilation. We extend the approach of compiling a diagnostic model, as is done by, for example, an ATMS, to compiling an approximate model. Approximate compilation overcomes the problem of space required for the compilation being worst-case exponential in particular model parameters, such as the p...
متن کاملComputing Minimal Diagnoses by Greedy Stochastic Search
Most algorithms for computing diagnoses within a modelbased diagnosis framework are deterministic. Such algorithms guarantee soundness and completeness, but are Σ2 hard. To overcome this complexity problem, which prohibits the computation of high-cardinality diagnoses for large systems, we propose a novel approximation approach for multiple-fault diagnosis, based on a greedy stochastic algorith...
متن کاملApproximate Weak Greedy Algorithms
We present a generalization of V. Temlyakov’s weak greedy algorithm, and give a sufficient condition for norm convergence of the algorithm for an arbitrary dictionary in a Hilbert space. We provide two counter-examples to show that the condition cannot be relaxed for general dictionaries. For a class of dictionaries with more structure, we give a more relaxed necessary and sufficient condition ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Artificial Intelligence Research
سال: 2010
ISSN: 1076-9757
DOI: 10.1613/jair.3025